<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>101</b></div></td><td><div><a href="index.php?section=problems&amp;id=101" style="text-decoration:none;" title="Click to view problem">
Investigate the optimum polynomial function to model the first <i>k</i> terms of a given sequence.
</a></div></td><td><div style="text-align:center;">2003</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>102</b></div></td><td><div><a href="index.php?section=problems&amp;id=102" style="text-decoration:none;" title="Click to view problem">
For how many triangles in the text file does the interior contain the origin?
</a></div></td><td><div style="text-align:center;">4735</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>103</b></div></td><td><div><a href="index.php?section=problems&amp;id=103" style="text-decoration:none;" title="Click to view problem">
Investigating sets with a special subset sum property.
</a></div></td><td><div style="text-align:center;">1501</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>104</b></div></td><td><div><a href="index.php?section=problems&amp;id=104" style="text-decoration:none;" title="Click to view problem">
Finding Fibonacci numbers for which the first and last nine digits are pandigital.
</a></div></td><td><div style="text-align:center;">3444</div></td></tr>

<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>105</b></div></td><td><div><a href="index.php?section=problems&amp;id=105" style="text-decoration:none;" title="Click to view problem">
Find the sum of the special sum sets in the file.
</a></div></td><td><div style="text-align:center;">1474</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>106</b></div></td><td><div><a href="index.php?section=problems&amp;id=106" style="text-decoration:none;" title="Click to view problem">
Find the minimum number of comparisons needed to identify special sum sets.
</a></div></td><td><div style="text-align:center;">1234</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>107</b></div></td><td><div><a href="index.php?section=problems&amp;id=107" style="text-decoration:none;" title="Click to view problem">
Determining the most efficient way to connect the network.
</a></div></td><td><div style="text-align:center;">2149</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>108</b></div></td><td><div><a href="index.php?section=problems&amp;id=108" style="text-decoration:none;" title="Click to view problem">
Solving the Diophantine equation 1/<var>x</var> + 1/<var>y</var> = 1/<var>n</var>.
</a></div></td><td><div style="text-align:center;">2967</div></td></tr>

<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>109</b></div></td><td><div><a href="index.php?section=problems&amp;id=109" style="text-decoration:none;" title="Click to view problem">
How many distinct ways can a player checkout in the game of darts with a score of less than 100?
</a></div></td><td><div style="text-align:center;">1527</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>110</b></div></td><td><div><a href="index.php?section=problems&amp;id=110" style="text-decoration:none;" title="Click to view problem">
Find an efficient algorithm to analyse the number of solutions of the equation 1/<var>x</var> + 1/<var>y</var> = 1/<var>n</var>.
</a></div></td><td><div style="text-align:center;">1821</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>111</b></div></td><td><div><a href="index.php?section=problems&amp;id=111" style="text-decoration:none;" title="Click to view problem">
Search for 10-digit primes containing the maximum number of repeated digits.
</a></div></td><td><div style="text-align:center;">1413</div></td></tr>

<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>112</b></div></td><td><div><a href="index.php?section=problems&amp;id=112" style="text-decoration:none;" title="Click to view problem">
Investigating the density of "bouncy" numbers.
</a></div></td><td><div style="text-align:center;">5448</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>113</b></div></td><td><div><a href="index.php?section=problems&amp;id=113" style="text-decoration:none;" title="Click to view problem">
How many numbers below a googol (10<sup>100</sup>) are not &quot;bouncy&quot;?
</a></div></td><td><div style="text-align:center;">2564</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>114</b></div></td><td><div><a href="index.php?section=problems&amp;id=114" style="text-decoration:none;" title="Click to view problem">
Investigating the number of ways to fill a row with separated blocks that are at least three units long.
</a></div></td><td><div style="text-align:center;">2282</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>115</b></div></td><td><div><a href="index.php?section=problems&amp;id=115" style="text-decoration:none;" title="Click to view problem">
Finding a generalisation for the number of ways to fill a row with separated blocks.
</a></div></td><td><div style="text-align:center;">2092</div></td></tr>

<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>116</b></div></td><td><div><a href="index.php?section=problems&amp;id=116" style="text-decoration:none;" title="Click to view problem">
Investigating the number of ways of replacing square tiles with one of three coloured tiles.
</a></div></td><td><div style="text-align:center;">2612</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>117</b></div></td><td><div><a href="index.php?section=problems&amp;id=117" style="text-decoration:none;" title="Click to view problem">
Investigating the number of ways of tiling a row using different-sized tiles.
</a></div></td><td><div style="text-align:center;">2377</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>118</b></div></td><td><div><a href="index.php?section=problems&amp;id=118" style="text-decoration:none;" title="Click to view problem">
Exploring the number of ways in which sets containing prime elements can be made.
</a></div></td><td><div style="text-align:center;">1302</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>119</b></div></td><td><div><a href="index.php?section=problems&amp;id=119" style="text-decoration:none;" title="Click to view problem">
Investigating the numbers which are equal to sum of their digits raised to some power.
</a></div></td><td><div style="text-align:center;">2575</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>120</b></div></td><td><div><a href="index.php?section=problems&amp;id=120" style="text-decoration:none;" title="Click to view problem">
Finding the maximum remainder when (<i>a</i> &minus; 1)<sup><i>n</i></sup> + (<i>a</i> + 1)<sup><i>n</i></sup> is divided by <i>a</i><sup>2</sup>.
</a></div></td><td><div style="text-align:center;">3067</div></td></tr>

<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>121</b></div></td><td><div><a href="index.php?section=problems&amp;id=121" style="text-decoration:none;" title="Click to view problem">
Investigate the game of chance involving coloured discs.
</a></div></td><td><div style="text-align:center;">1876</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>122</b></div></td><td><div><a href="index.php?section=problems&amp;id=122" style="text-decoration:none;" title="Click to view problem">
Finding the most efficient exponentiation method.
</a></div></td><td><div style="text-align:center;">1652</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>123</b></div></td><td><div><a href="index.php?section=problems&amp;id=123" style="text-decoration:none;" title="Click to view problem">
Determining the remainder when (<i>p<sub>n</sub></i> &minus; 1)<sup><i>n</i></sup> + (<i>p<sub>n</sub></i> + 1)<sup><i>n</i></sup> is divided by <i>p<sub>n</sub></i><sup>2</sup>.
</a></div></td><td><div style="text-align:center;">2711</div></td></tr>

<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>124</b></div></td><td><div><a href="index.php?section=problems&amp;id=124" style="text-decoration:none;" title="Click to view problem">
Determining the <i>k</i><sup>th</sup> element of the sorted radical function.
</a></div></td><td><div style="text-align:center;">3489</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>125</b></div></td><td><div><a href="index.php?section=problems&amp;id=125" style="text-decoration:none;" title="Click to view problem">
Finding square sums that are palindromic.
</a></div></td><td><div style="text-align:center;">3028</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>126</b></div></td><td><div><a href="index.php?section=problems&amp;id=126" style="text-decoration:none;" title="Click to view problem">
Exploring the number of cubes required to cover every visible face on a cuboid.
</a></div></td><td><div style="text-align:center;">908</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>127</b></div></td><td><div><a href="index.php?section=problems&amp;id=127" style="text-decoration:none;" title="Click to view problem">
Investigating the number of <i>abc-hits</i> below a given limit.
</a></div></td><td><div style="text-align:center;">1174</div></td></tr>

<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>128</b></div></td><td><div><a href="index.php?section=problems&amp;id=128" style="text-decoration:none;" title="Click to view problem">
Which tiles in the hexagonal arrangement have prime differences with neighbours?
</a></div></td><td><div style="text-align:center;">1018</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>129</b></div></td><td><div><a href="index.php?section=problems&amp;id=129" style="text-decoration:none;" title="Click to view problem">
Investigating minimal repunits that divide by <i>n</i>.
</a></div></td><td><div style="text-align:center;">1303</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>130</b></div></td><td><div><a href="index.php?section=problems&amp;id=130" style="text-decoration:none;" title="Click to view problem">
Finding composite values, <i>n</i>, for which <i>n</i>&minus;1 is divisible by the length of the smallest repunits that divide it.
</a></div></td><td><div style="text-align:center;">1248</div></td></tr>

<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>131</b></div></td><td><div><a href="index.php?section=problems&amp;id=131" style="text-decoration:none;" title="Click to view problem">
Determining primes, <i>p</i>, for which <i>n</i><sup>3</sup> + <i>n</i><sup>2</sup><i>p</i> is a perfect cube.
</a></div></td><td><div style="text-align:center;">1583</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>132</b></div></td><td><div><a href="index.php?section=problems&amp;id=132" style="text-decoration:none;" title="Click to view problem">
Determining the first forty prime factors of a very large repunit.
</a></div></td><td><div style="text-align:center;">1392</div></td></tr>

<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>133</b></div></td><td><div><a href="index.php?section=problems&amp;id=133" style="text-decoration:none;" title="Click to view problem">
Investigating which primes will never divide a repunit containing 10<sup><var>n</var></sup> digits.
</a></div></td><td><div style="text-align:center;">1190</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>134</b></div></td><td><div><a href="index.php?section=problems&amp;id=134" style="text-decoration:none;" title="Click to view problem">
Finding the smallest positive integer related to any pair of consecutive primes.
</a></div></td><td><div style="text-align:center;">1462</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>135</b></div></td><td><div><a href="index.php?section=problems&amp;id=135" style="text-decoration:none;" title="Click to view problem">
Determining the number of solutions of the equation <i>x</i><sup>2</sup> &minus; <i>y</i><sup>2</sup> &minus; <i>z</i><sup>2</sup> = <i>n</i>.
</a></div></td><td><div style="text-align:center;">1365</div></td></tr>

<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>136</b></div></td><td><div><a href="index.php?section=problems&amp;id=136" style="text-decoration:none;" title="Click to view problem">
Discover when the equation <i>x</i><sup>2</sup> &minus; <i>y</i><sup>2</sup> &minus; <i>z</i><sup>2</sup> = <i>n</i> has a unique solution.
</a></div></td><td><div style="text-align:center;">1196</div></td></tr>

<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>137</b></div></td><td><div><a href="index.php?section=problems&amp;id=137" style="text-decoration:none;" title="Click to view problem">
Determining the value of infinite polynomial series for which the coefficients are Fibonacci numbers.
</a></div></td><td><div style="text-align:center;">1158</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>138</b></div></td><td><div><a href="index.php?section=problems&amp;id=138" style="text-decoration:none;" title="Click to view problem">
Investigating isosceles triangle for which the height and base length differ by one.
</a></div></td><td><div style="text-align:center;">1301</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>139</b></div></td><td><div><a href="index.php?section=problems&amp;id=139" style="text-decoration:none;" title="Click to view problem">
Finding Pythagorean triangles which allow the square on the hypotenuse to be tiled.
</a></div></td><td><div style="text-align:center;">1141</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>140</b></div></td><td><div><a href="index.php?section=problems&amp;id=140" style="text-decoration:none;" title="Click to view problem">
Investigating the value of infinite polynomial series for which the coefficients are a linear second order recurrence relation.
</a></div></td><td><div style="text-align:center;">903</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>141</b></div></td><td><div><a href="index.php?section=problems&amp;id=141" style="text-decoration:none;" title="Click to view problem">
Investigating progressive numbers, <i>n</i>, which are also square.
</a></div></td><td><div style="text-align:center;">791</div></td></tr>

<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>142</b></div></td><td><div><a href="index.php?section=problems&amp;id=142" style="text-decoration:none;" title="Click to view problem">
Perfect Square Collection
</a></div></td><td><div style="text-align:center;">1263</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>143</b></div></td><td><div><a href="index.php?section=problems&amp;id=143" style="text-decoration:none;" title="Click to view problem">
Investigating the Torricelli point of a triangle 

</a></div></td><td><div style="text-align:center;">575</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>144</b></div></td><td><div><a href="index.php?section=problems&amp;id=144" style="text-decoration:none;" title="Click to view problem">
Investigating multiple reflections of a laser beam. 
</a></div></td><td><div style="text-align:center;">923</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>145</b></div></td><td><div><a href="index.php?section=problems&amp;id=145" style="text-decoration:none;" title="Click to view problem">
How many reversible numbers are there below one-billion?
</a></div></td><td><div style="text-align:center;">3811</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>146</b></div></td><td><div><a href="index.php?section=problems&amp;id=146" style="text-decoration:none;" title="Click to view problem">
Investigating a Prime Pattern 
</a></div></td><td><div style="text-align:center;">1072</div></td></tr>

<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>147</b></div></td><td><div><a href="index.php?section=problems&amp;id=147" style="text-decoration:none;" title="Click to view problem">
Rectangles in cross-hatched grids
</a></div></td><td><div style="text-align:center;">626</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>148</b></div></td><td><div><a href="index.php?section=problems&amp;id=148" style="text-decoration:none;" title="Click to view problem">
Exploring Pascal's triangle.
</a></div></td><td><div style="text-align:center;">1159</div></td></tr>
<tr class="bg_table_row1"><td style="height:40px;"><div style="text-align:center;"><b>149</b></div></td><td><div><a href="index.php?section=problems&amp;id=149" style="text-decoration:none;" title="Click to view problem">
Searching for a maximum-sum subsequence.
</a></div></td><td><div style="text-align:center;">1018</div></td></tr>
<tr class="bg_table_row2"><td style="height:40px;"><div style="text-align:center;"><b>150</b></div></td><td><div><a href="index.php?section=problems&amp;id=150" style="text-decoration:none;" title="Click to view problem">
Searching a triangular array for a sub-triangle having minimum-sum.
</a></div></td><td><div style="text-align:center;">824</div></td></tr>

